Shortest-path and Hot-potato Routing on Unbuuered 2-d Tori
نویسندگان
چکیده
We probabilistically model dynamic routing on un-buuered 2-dimensional tori. We consider shortest-path routing with packet loss and retransmissions versus a newly proposed all-link busy (ALB) hot-potato routing strategy with packet deeections. Computations of the sustained packet generating rate, node through-put, and average packet latency indicate that the proposed ALB strategy is a much better alternative to a shortest-path routing on unbuuered tori. It achieves an almost optimal sustained packet generating rate, near-optimal latency, and acceptable node throughput.
منابع مشابه
Shortest-path and Hot-potato Routing on Unbuuered Toroidal Networks
We probabilistically model dynamic packet routing on unbuuered 2-D and 3-D toroidal networks. We consider shortest-path routing with packet loss and retrans-missions versus a newly proposed all-link busy (ALB) hot-potato routing strategy with packet deeections. Computations of the sustained packet generating rate, node throughput, and average packet latency indicate that the proposed ALB strate...
متن کاملPure Greedy Hot-Potato Routing in the 2-D Mesh with Random Destinations
We analyze here a pure greedy hot-potato routing strategy on a two-dimensional mesh of n nodes. We speci cally study the case of n packets, originating one per node, to be delivered at random uniform destinations. Each packet attempts to follow the shortest path leading rst to the destination row/column (whichever is closest) and then to the actual destination node. A de ection policy is adopte...
متن کاملFlying Hot Potatoes
Optical communication networks and air traffic management systems share the same fundamental routing problem as both optical packets and aircraft must continuously move within the network, while avoiding conflicts. In this paper, we explore the use of hot potato and deflection routing algorithms, which are established routing methods in optical communication networks, in the conflict-free routi...
متن کاملExperimental Evaluation of Hot { Potato RoutingAlgorithms on 2 { Dimensional Processor Arrays ?
In this paper we consider the problem of routing packets in two{dimensional torus{connected processor arrays. We describe the implementation of four hot{potato routing algorithms and study their performance by experimentation. The algorithms are either greedy in the sense that packets try to move towards their destination by adaptively using a shortest path, or have the property that the path t...
متن کامل5 Conclusions and Open Problems
20] T. Szymanski. An analysis of \Hot Potato" routing in a ber optic packet switched hypercube. 21] Z. Zhang and A.S. Acampora. Performance analysis of multihop lightwave networks with hot potato routing and distance age priorities. The many-to-many routing problem studied here is symptomatic of the diiculties in analyzing hot potato algorithms. One intuitively believes that the \desired" dist ...
متن کامل